The SCBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problems

نویسندگان

  • Xian-Ming Gu
  • Markus Clemens
  • Ting-Zhu Huang
  • Liang Li
چکیده

Frequency domain formulations of computational electromagnetic problems often require the solutions of complex-valued non-Hermitian systems of equations, which are still symmetric. For this kind of problems a whole class of sub-variant solver methods derived from the complex-valued Bi-Conjugate Gradient method is available. This class of methods contains established solution methods as the Conjugate Orthogonal Conjugate Gradient (COCG) method, Bi-Conjugate Gradient Conjugate Residual (BiCGCR) method and Conjugate AOrthogonal Conjugate Residual (COCR) method. The mathematical equivalence of the BiCGCR method and COCR method is shown and preconditioned variants of the various solvers are derived. An efficient kind of two-step preconditioning technique is also proposed. Numerical experiments involving e.g. electro-quasistatic frequency domain simulation are employed to show the difference in the convergence behavior of these iterative methods and effectiveness of the two-step preconditioning techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Methods for the Solution of Very Large Complex Symmetric Linear Systems

In the eld of computational electrodynamics the discretization of Maxwell's equations using the Finite Integration Theory (FIT) yields very large, sparse, complex symmetric linear systems of equations. For this class of complex non-Hermitian systems a number of conjugate gradient-type algorithms is considered. The complex version of the biconjugate gradient (BiCG) method by Jacobs can be extend...

متن کامل

Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

NEW MODELS AND ALGORITHMS FOR SOLUTIONS OF SINGLE-SIGNED FULLY FUZZY LR LINEAR SYSTEMS

We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...

متن کامل

Solving a generalized aggregate production planning problem by genetic algorithms

This paper presents a genetic algorithm (GA) for solving a generalized model of single-item resource-constrained aggregate production planning (APP) with linear cost functions. APP belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. We linearize a linear mixed-integer model of APP subject to hiring...

متن کامل

Particle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Physics Communications

دوره 191  شماره 

صفحات  -

تاریخ انتشار 2015